/*
 * Maximum Path Sum II Solution.
 */

import java.util.Date;

/**
 * Driver for Euler 67 solutions.
 * @author Michael
 */

public class EulerDriver {
    
    public static void main (String [] args) 
    {
        long start;
        long end;
        
        // Solve the problem using dyanmic programming
        start = new Date().getTime();
        System.out.print( "DP : " + Euler67DP.solve(args[0]) );
        end = new Date().getTime();
        System.out.println(" (Runtime: " + (end-start) + " ms)");
        
        // Solve the problem using a weighted directed graph
        start = new Date().getTime();
        System.out.print( "Graph : " + Euler67Graph.solve( args[0] ) );
        end = new Date().getTime();
        System.out.println(" (Runtime: " + (end-start) + " ms)");  
         
    }
    
}
